#include <iostream>

using namespace std;

/*
refer question description and algorith from ShortestPath.

this one is a simplified version for interview question.
*/

#define MAX	5


void Dijkstra( int matrix[][MAX], int src, int *distance, int* path, bool *visit )
{

}

int main()
{
	int matrix[MAX][MAX]={{0,0,1,1,0},{0,0,0,0,0},{0,1,0,0,1},{0,0,0,0,1},{0,0,0,1,0}};

	cout<<"Press any key to terminate..."<<endl;
	return getchar();
}